Algorithms for Next Generation Networks by Graham Cormode & Marina Thottan

Author:Graham Cormode & Marina Thottan
Language: eng
Format: epub
Publisher: Springer London, London

∗

A quantifier denoting zero or more

A ∗ means an arbitrary number of As

{}

Repeat

A{100} denotes a sequence of 100 As

[ ]

A class of characters

[lwt] denotes a letter l, w, or t

[ˆ]

Anything but

[ˆ ∖ n] denotes any character except ∖ n

Finite automata are a natural formalism for regular expression matching. There are two main categories: deterministic finite Automaton (DFA) and Nondeterministic Finite Automaton (NFA). This section provides a brief survey of existing methods using these two types of automata.

Download

Copyright Disclaimer:
This site does not store any files on its server. We only index and link to content provided by other sites. Please contact the content providers to delete copyright contents if any and email us, we'll remove relevant links or contents immediately.